NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
381	Sequential Model-Based Optimization for General Algorithm Configuration Frank Hutter, Holger H. Hoos and Kevin Leyton-Brown University of British Columbia, 2366 Main Mall, Vancouver BC, V6T 1Z4, Canada {hutter,hoos,kevin Add to Reading List Source URL: www.cs.ubc.ca Language: English - Date: 2014-12-16 08:35:37 Cybernetics Mathematical optimization NP-complete problems Formal methods Algorithm Genetic algorithm Ant colony optimization algorithms Evolutionary algorithm Computational complexity theory Applied mathematics Mathematics Theoretical computer science
382	MOVESAbstracts Plenary Talks Elwyn Berlekamp, University of California, Berkeley The Game of Amazons Abstract coming soon! John H. Conway, Princeton University Add to Reading List Source URL: momath.org Language: English - Date: 2015-06-03 09:13:46 Combinatorial game theory NP-complete problems Logic puzzles Mathematical game John Horton Conway Mathematical puzzle Combinatorics Polyomino Mechanical puzzle Mathematics Recreational mathematics Puzzles
383	Course: Satisfiability Modulo Theories (SMT): ideas and applications Send your assignment to: 1. Mark the following formulas as valid, satisfiable or unsatisfiable. a. p  q  p  q b. (p  Add to Reading List Source URL: leodemoura.github.io Language: English - Date: 2015-05-19 13:22:05 NP-complete problems Mathematical logic Electronic design automation Formal methods Logic in computer science Boolean satisfiability problem Resolution Satisfiability Modulo Theories If and only if Theoretical computer science Mathematics Logic
384	TRY TH S Listening and Logic LEVEL: Low Intermediate and above MATERIALS: Copies of the logic grids and Add to Reading List Source URL: americanenglish.state.gov Language: English - Date: 2015-03-13 08:01:39 Breakfast Fried egg Personal life NP-complete problems Human behavior Crossword Meals Breakfast foods Logic puzzles
385	Tensors and Optimization Ravi Kannan September 16, 2013 Ravi Kannan Add to Reading List Source URL: simons.berkeley.edu Language: English - Date: 2014-03-13 13:08:11 Mathematical optimization Applied mathematics Mathematics Logic in computer science Constraint programming NP-complete problems Theoretical computer science Operations research Tensor
386	MUNCH - Automated Reasoner for Sets and Multisets Ruzica Piskac and Viktor Kuncak Swiss Federal Institute of Technology Lausanne (EPFL) Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2010-05-11 07:07:53 Logic in computer science Metalogic Model theory Multiset NP-complete problems Presburger arithmetic Satisfiability Modulo Theories Cardinality Generalized arithmetic progression Mathematics Mathematical logic Theoretical computer science
387	Complete Functional Synthesis Viktor Kuncak Mika¨el Mayer Ruzica Piskac Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2010-04-01 07:52:40 Model theory Logic in computer science Predicate logic Semantics NP-complete problems Satisfiability Modulo Theories Function First-order logic Quantifier elimination Mathematics Mathematical logic Logic
388	Integrality Gaps for Sherali–Adams Relaxations Moses Charikar∗ Princeton University Konstantin Makarychev IBM T.J. Watson Research Center Add to Reading List Source URL: konstantin.makarychev.net Language: English - Date: 2014-06-08 22:16:40 NP-complete problems Connectivity Vertex cover Linear programming relaxation Tree Graph SL Regular graph Graph theory Theoretical computer science Mathematics
389	Algorithms Lecture 4: Efficient Exponential-Time Algorithms [Fa’14] Wouldn’t the sentence “I want to put a hyphen between the words Fish and And and And and Chips in my Fish-And-Chips sign.” have been clearer if Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:22 NP-complete problems Analysis of algorithms Graph coloring Graph theory Time complexity Boolean satisfiability problem Randomized algorithm MAXEkSAT One-in-three 3SAT Theoretical computer science Computational complexity theory Mathematics
390	PDF Document Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-04-17 12:02:13 NP-complete problems Graph coloring Tree Clique Maximal independent set Graph Connectivity Connected component Independent set Graph theory Mathematics Theoretical computer science

UPDATE